Achieving Stability in the Round Robin Algorithm
نویسندگان
چکیده
The Round Robin algorithm is a CPU scheduling algorithm that is designed especially for time sharing systems. Each process is assigned a slice of time called time quantum to execute. To increase the performance of a Round Robin algorithm, it is important to choose an optimal time quantum. Many algorithms developed the Round Robin algorithm. This paper provides an algorithm that improves the performance of these algorithms and develops a time quantum that achieves stability in terms of the average waiting time and the average turnaround time. General Terms Scheduling algorithms, Round Robin algorithms.
منابع مشابه
Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملTowards Transcoding as a Service in Multimedia Cloud: Energy-Efficient Job Dispatching Algorithm
In this paper, we investigate energy-efficient job dispatching algorithm for transcoding as a service (TaaS) in a multimedia cloud. We aim to minimize the energy consumption of service engines in the cloud while achieving low delay for TaaS. We formulate the job dispatching problem as a constrained optimization problem under the framework of Lyapunov optimization. Using the drift-plus-penalty f...
متن کاملData Replication-Based Scheduling in Cloud Computing Environment
Abstract— High-performance computing and vast storage are two key factors required for executing data-intensive applications. In comparison with traditional distributed systems like data grid, cloud computing provides these factors in a more affordable, scalable and elastic platform. Furthermore, accessing data files is critical for performing such applications. Sometimes accessing data becomes...
متن کاملStable and Practical Scheduling Algorithms for High Speed Virtual Output Queuing Switches
High-performance input queued switches achieve good performance with low cost. However, with the appearance of optical techniques, the line rate is much higher than before. Scheduling algorithms require not only good performance in delay and stability but fast speed and simple implementation as well. A variety of scheduling algorithms for Virtual Output Queuing (VOQ) packet switch architecture ...
متن کاملCamparison of Numerically Stability of Two Algorithms for the Calculation of Variance
In descriptive statistics, there are two computational algorithms for determining the variance S2, of a set of observations : Algorithm 1: S2= - , Algorithm 2: S2= , where . It is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. I this paper, based on total effect of rounding error, we prove that the second Algorithm is better...
متن کامل